An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems

Descriptor systems consisting of a large number of differential-algebraic equations (DAEs) usually arise from the discretization of partial differential-algebraic equations. This paper presents an efficient algorithm for solving the coupled Sylvester equation that arises in converting a system of linear DAEs to ordinary differential equations. A significant computational advantage is obtained b...

متن کامل

Solution to Sylvester equation associated to linear descriptor systems

This paper presents the solution of the constrained Sylvester equation associated to linear descriptor systems. This problem has been recently studied in [1], where sufficient conditions for the existence of the solution are given. In the present paper, a simple and direct method is developed to solve this problem. This method shows that the conditions given in [1] are necessary and sufficient.

متن کامل

An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations

‎In this paper‎, ‎an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed‎. ‎The convergence analysis of the algorithm is investigated‎. ‎We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions‎. ‎Finally‎, ‎some numerical examples are given to demons...

متن کامل

Consistency and efficient solution of the Sylvester equation for *-congruence

In this paper, the matrix equation AX + XB = C is considered, where the matrices A and B have sizes m × n and n × m, respectively, the size of the unknown X is n × m, and the operator (·) denotes either the transpose or the conjugate transpose of a matrix. In the first part of the paper, necessary and sufficient conditions for the existence and uniqueness of solutions are reviewed. These condit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2011

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2010.10.038